Locally Recoverable codes from rational maps
نویسندگان
چکیده
We point some contributions to the construction of Locally Recoverable codes from algebraic curves recently presented by A. Barg, I. Tamo and S. Vladut, that can lead to improvements concerning the definition, the parameters and the local recovering of these codes.
منابع مشابه
Construction of optimal locally repairable codes via automorphism groups of rational function fields
Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS co...
متن کاملLocally Recoverable Codes with Availability t≥2 from Fiber Products of Curves
We generalize the construction of locally recoverable codes on algebraic curves given by Barg, Tamo and Vlăduţ [4] to those with arbitrarily many recovery sets by exploiting the structure of fiber products of curves. Employing maximal curves, we create several new families of locally recoverable codes with multiple recovery sets, including codes with two recovery sets from the generalized Giuli...
متن کاملLocally recoverable codes from algebraic curves and surfaces
A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vlăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.
متن کاملLocal List Recovery of High-Rate Tensor Codes & Applications
In this work, we give the first construction of high-rate locally list-recoverable codes. Listrecovery has been an extremely useful building block in coding theory, and our motivation is to use these codes as such a building block. In particular, our construction gives the first capacity-achieving locally list-decodable codes (over constant-sized alphabet); the first capacity achieving globally...
متن کاملHigher Hamming weights for locally recoverable codes on algebraic curves
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC codes, that are LRC codes from Norm-Trace curve. Finally, using some properties of Hermitian codes, we improve the bounds of distance proposed in [1] for some...
متن کامل